Factor Analysis as Matrix Decomposition

نویسنده

  • JAN DE LEEUW
چکیده

Meet the abstract. This is the abstract.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the polar decomposition of a matrix by an efficient iterative method

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

متن کامل

Total Factor Productivity Growth, Technical Change and Technical Efficiency Change in Asian Economies: Decomposition Analysis

The aim of this paper is to analyze total factor productivity (TFP) growth and its components in Asian countries applying Stochastic Frontier Analysis (SFA) to the time series data of 44 Asian countries from 2000 to 2010. Using Battese and Coelli approach, TFP is divided into technical efficiency change and technical change. TFP decomposition using SFA method for the years 1998 to 2007 indicate...

متن کامل

Exploratory factor and principal component analyses: some new aspects

Exploratory Factor Analysis (EFA) and Principal Component Analysis (PCA) are popular techniques for simplifying presentation of, and investigating structure of, an (n×p) data matrix. However, these fundamentally different techniques are frequently confused, and the differences between them are obscured, because they give similar results in some practical cases. We therefore investigate conditio...

متن کامل

Discovery of optimal factors in binary data via a novel method of matrix decomposition

a r t i c l e i n f o a b s t r a c t Keywords: Binary matrix decomposition Factor analysis Binary data Formal concept analysis Concept lattice We present a novel method of decomposition of an n × m binary matrix I into a Boolean product A • B of an n × k binary matrix A and a k × m binary matrix B with k as small as possible. Attempts to solve this problem are known from Boolean factor analysi...

متن کامل

DECOMPOSITION METHOD FOR SOLVING FULLY FUZZY LINEAR SYSTEMS

In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.

متن کامل

Discovery of factors in binary data triangular decomposition of matrices

We present new methods of decomposition of an n ×m binary matrix I into a product A ∗ B of an n × k binary matrix A and a k×m binary matrix B. These decompositions are alternative to the usual one which is sought in Boolean factor analysis (BFA), where ∗ is a Boolean product of matrices. In the new decompositions, ∗ are the left and the right triangular products of Boolean matrices. In BFA, I i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008